Matching groups and gliding systems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centralized Clustering Method To Increase Accuracy In Ontology Matching Systems

Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

متن کامل

commuting and non -commuting graphs of finit groups

فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...

15 صفحه اول

Groups and Ultra-groups

In this paper, in addition to some elementary facts about the ultra-groups, which their structure based on the properties of the transversal of a subgroup of a group, we focus on the relation between a group and an ultra-group. It is verified that every group is an ultra-group, but the converse is not true generally. We present the conditions under which, for every normal subultra-group of an u...

متن کامل

Optimal Pair Matching With Two Control Groups

In an effort to detect hidden biases due to failure to control for an unobserved covariate, some observational or nonrandomized studies include two control groups selected to systematically vary the unobserved covariate. Comparisons of the treated group and two control groups must, of course, control for imbalances in observed covariates. Using the three groups, we form pairs optimally matched ...

متن کامل

Gliding spline motions and applications

We consider the ICP (iterative closest point) algorithm, which may in general be used for moving ‘active’ elements such as curves and surfaces towards geometric objects whose distance field is computable. We show how it may be accelerated, and how it can be applied to the design of near-Euclidean near-contact spline motions. One particular application of this concept is the modeling of milling ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Geometry and Physics

سال: 2014

ISSN: 0393-0440

DOI: 10.1016/j.geomphys.2014.03.009